An Algorithm for Computing a Sequence of Richelot Isogenies
نویسندگان
چکیده
We show that computation of a sequence of Richelot isogenies from specified supersingular Jacobians of genus-2 curves over Fp can be executed in Fp2 or Fp4 . Based on this, we describe a practical algorithm for computing a Richelot isogeny sequence.
منابع مشابه
The Arithmetic of Genus Two Curves with (4,4)-split Jacobians
In this paper we study genus 2 curves whose Jacobians are (4, 4)-isogenous to a product of elliptic curves. Such Jacobians are called (4, 4)-split. We consider base fields of characteristic different from 2 and 3, which we do not assume to be algebraically closed. We give a generic model such that any genus 2 curve with optimally (4, 4)-split Jacobian can be obtained as a specialization. We als...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملImage Encryption by Using Combination of DNA Sequence and Lattice Map
In recent years, the advancement of digital technology has led to an increase in data transmission on the Internet. Security of images is one of the biggest concern of many researchers. Therefore, numerous algorithms have been presented for image encryption. An efficient encryption algorithm should have high security and low search time along with high complexity.DNA encryption is one of the fa...
متن کاملA Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies
We derive a new formula for computing arbitrary odd-degree isogenies between elliptic curves in Montgomery form. The formula lends itself to a simple and compact algorithm that can efficiently compute any low odd-degree isogenies inside the supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. Our implementation of this algorithm shows that, beyond the commonly used 3-isogenies, th...
متن کاملFast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ` (` different from the characteristic) in time quasi-linear with respect to `. This is based in particular on fast algorithms for power series expansion of the Weierstrass ℘-function and related fu...
متن کامل